Combinatorial theory of Macdonald polynomials I: proof of Haglund's formula.

نویسندگان

  • J Haglund
  • M Haiman
  • N Loehr
چکیده

Haglund recently proposed a combinatorial interpretation of the modified Macdonald polynomials H(mu). We give a combinatorial proof of this conjecture, which establishes the existence and integrality of H(mu). As corollaries, we obtain the cocharge formula of Lascoux and Schutzenberger for Hall-Littlewood polynomials, a formula of Sahi and Knop for Jack's symmetric functions, a generalization of this result to the integral Macdonald polynomials J(mu), a formula for H(mu) in terms of Lascoux-Leclerc-Thibon polynomials, and combinatorial expressions for the Kostka-Macdonald coefficients K(lambda,mu) when mu is a two-column shape.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applications of Macdonald Polynomials

s for Talks Speaker: Nick Loehr (Virginia Tech, USA) (talk describes joint work with Jim Haglund and Mark Haiman) Title: Symmetric and Non-symmetric Macdonald Polynomials Abstract: Macdonald polynomials have played a central role in symmetric function theory ever since their introduction by Ian Macdonald in 1988. The original algebraic definitions of these polynomials are very nonexplicit and d...

متن کامل

The Schur Expansion of Macdonald Polynomials

Building on Haglund’s combinatorial formula for the transformed Macdonald polynomials, we provide a purely combinatorial proof of Macdonald positivity using dual equivalence graphs and give a combinatorial formula for the coefficients in the Schur expansion.

متن کامل

A Combinatorial Formula for Macdonald Polynomials

The Macdonald polynomials H̃μ(x; q, t) have been the subject of much attention in combinatorics since Macdonald [25] defined them and conjectured that their expansion in terms of Schur polynomials should have positive coefficients. Macdonald’s conjecture was proven in [11] by geometric and representation-theoretic means, but these results do not provide any purely combinatorial interpretation fo...

متن کامل

A Bijective Proof of a Factorization Formula for Macdonald Polynomials at Roots of Unity

We give a combinatorial proof of the factorization formula of modified Macdonald polynomials H̃λ(X ; q, t) when t is specialized at a primitive root of unity. Our proof is restricted to the special case where λ is a two columns partition. We mainly use the combinatorial interpretation of Haiman, Haglund and Loehr giving the expansion of H̃λ(X ; q, t) on the monomial basis.

متن کامل

Dual Equivalence Graphs and a Combinatorial Proof of Llt and Macdonald Positivity

We make a systematic study of a new combinatorial construction called a dual equivalence graph. We axiomatize these graphs and prove that their generating functions are symmetric and Schur positive. By constructing a graph on ribbon tableaux which we transform into a dual equivalence graph, we give a combinatorial proof of the symmetry and Schur positivity of the ribbon tableaux generating func...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Proceedings of the National Academy of Sciences of the United States of America

دوره 102 8  شماره 

صفحات  -

تاریخ انتشار 2005